Point Set Registration via Particle Filtering and Stochastic Dynamics
نویسندگان
چکیده
منابع مشابه
Stochastic Optimization for Rigid Point Set Registration
In this paper we propose a new method for pairwise rigid point set registration. We pay special attention to noise robustness, outlier resistance and global optimal alignment. The problem of registering two point clouds in space is converted to a minimization of a nonlinear cost function. We propose a cost function that aims to reduce the impact of noise and outliers. Its definition is based on...
متن کاملSOAR: Stochastic Optimization for Affine global point set Registration
We introduce a stochastic algorithm for pairwise affine registration of partially overlapping 3D point clouds with unknown point correspondences. The algorithm recovers the globally optimal scale, rotation, and translation alignment parameters and is applicable in a variety of difficult settings, including very sparse, noisy, and outlierridden datasets that do not permit the computation of loca...
متن کاملDensity Adaptive Point Set Registration
Probabilistic methods for point set registration havedemonstrated competitive results in recent years. Thesetechniques estimate a probability distribution model of thepoint clouds. While such a representation has shownpromise, it is highly sensitive to variations in the den-sity of 3D points. This fundamental problem is primar-ily caused by changes in the sensor location...
متن کاملImage Registration via Particle Movement
Though fluid model offers a good approach to nonrigid registration with large deformations, it suffers from the blurring artifacts introduced by the viscosity term. To overcome this drawback, we present an inviscid model expressed in a particle framework. Our idea is to simulate the template image as a set of particles moving towards the target positions. The proposed model can accommodate both...
متن کاملSmooth point-set registration using neighboring constraints
We present an approach for Maximum Likelihood estimation of correspondence and alignment parameters that benefits from the representational skills of graphs. We pose the problem as one of mixture modelling within the framework of the Expectation-Maximization algorithm. Our mixture model encompasses a Gaussian density to model the point-position errors and a Bernoulli density to model the struct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2010
ISSN: 0162-8828
DOI: 10.1109/tpami.2009.142